associative array - определение. Что такое associative array
Diclib.com
Словарь ChatGPT
Поиск в словаре Индивидуальные решения
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология
  1. Словари
  2. Английский словарь
  3. associative array

Что (кто) такое associative array - определение

DATA TYPE THAT ASSOCIATES KEYS WITH VALUES
Dictionary (data structure); Associative arrays; Map (computer science); Assoc list; Associative container; Map (data structure); Hash array; Hasharray; Key-value association; Key-value data; Associative map; Key–value data; Associative list; Dictionary (computer science); Language support for associative arrays; Map (computing); Associative table
  • This graph compares the average number of [[CPU cache]] misses required to look up elements in large hash tables (far exceeding size of the cache) with chaining and [[linear probing]]. Linear probing performs better due to better [[locality of reference]], though as the table gets full, its performance degrades drastically.
Найдено результатов: 385
associative array         
<programming> (Or "hash", "map", "dictionary") An array where the indices are not just integers but may be arbitrary strings. awk and its descendants (e.g. Perl) have associative arrays which are implemented using hash coding for faster look-up. (2007-10-02)
Associative array         
In computer science, an associative array, map, symbol table, or dictionary is an abstract data type that stores a collection of (key, value) pairs, such that each possible key appears at most once in the collection. In mathematical terms an associative array is a function with finite domain.
https://en.wikipedia.org/wiki/Associative_array
content addressable memory         
  • CMOS binary CAM Cell consisting of a 6T SRAM cell plus 4 comparison transistors. When the data on the search lines (SL) differs from the data stored in the cell through the bit lines (BL), the match line (ML) will be pulled low to indicate a mismatch. If none of the cells on a match line indicate a mismatched bit, the match line will remain high at the precharge level to indicate a word match. Both search lines can be held at logic '0' as a don't care search condition. Search lines and bit lines can be merged into a single pair of data lines.
  • CMOS Ternary CAM cell consisting of two 6T SRAM cells plus 4 comparison transistors. Normally opposite logic levels, either '0' and '1' or '1' and '0' will be stored in the two cells. For a don't care condition '0' will be stored in both cells so that the match line ML will not be pulled low for any combination of search line (SL) data.
SPECIAL TYPE OF COMPUTER MEMORY USED IN CERTAIN VERY-HIGH-SPEED SEARCHING APPLICATIONS
Associative storage; Content adressable memory; Content addressable memory; CAM (computing); Content-Addressable Memory; Associative Memory Base; Associative memory base; Ternary Content-Addressable Memory; Ternary content-addressable memory; Content-based addressing
(CAM, or "associative memory") A kind of storage device which includes comparison logic with each bit of storage. A data value is broadcast to all words of storage and compared with the values there. Words which match are flagged in some way. Subsequent operations can then work on flagged words, e.g. read them out one at a time or write to certain bit positions in all of them. A CAM can thus operate as a data parallel (SIMD) processor. CAMs are often used in caches and memory management units. (1995-02-16)
Content-addressable memory         
  • CMOS binary CAM Cell consisting of a 6T SRAM cell plus 4 comparison transistors. When the data on the search lines (SL) differs from the data stored in the cell through the bit lines (BL), the match line (ML) will be pulled low to indicate a mismatch. If none of the cells on a match line indicate a mismatched bit, the match line will remain high at the precharge level to indicate a word match. Both search lines can be held at logic '0' as a don't care search condition. Search lines and bit lines can be merged into a single pair of data lines.
  • CMOS Ternary CAM cell consisting of two 6T SRAM cells plus 4 comparison transistors. Normally opposite logic levels, either '0' and '1' or '1' and '0' will be stored in the two cells. For a don't care condition '0' will be stored in both cells so that the match line ML will not be pulled low for any combination of search line (SL) data.
SPECIAL TYPE OF COMPUTER MEMORY USED IN CERTAIN VERY-HIGH-SPEED SEARCHING APPLICATIONS
Associative storage; Content adressable memory; Content addressable memory; CAM (computing); Content-Addressable Memory; Associative Memory Base; Associative memory base; Ternary Content-Addressable Memory; Ternary content-addressable memory; Content-based addressing
Content-addressable memory (CAM) is a special type of computer memory used in certain very-high-speed searching applications. It is also known as associative memory or associative storage and compares input search data against a table of stored data, and returns the address of matching data.
https://en.wikipedia.org/wiki/Content-addressable_memory
Associative algebra         
ALGEBRA OVER A RING SUCH THAT MULTIPLICATION IS ASSOCIATIVE
Linear associative algebra; Abelian algebra; R-algebra; Associative Algebra; Associative algebras; Associative R-algebra; Commutative R-algebra; Commutative algebra (structure); Unital associative algebra; Draft:Associative algebra; Bidimension of an associative algebra; Wedderburn principal theorem; Enveloping algebra of an associative algebra
In mathematics, an associative algebra A is an algebraic structure with compatible operations of addition, multiplication (assumed to be associative), and a scalar multiplication by elements in some field K. The addition and multiplication operations together give A the structure of a ring; the addition and scalar multiplication operations together give A the structure of a vector space over K.
https://en.wikipedia.org/wiki/Associative_algebra
Dynamic array         
  • Θ(''n'')}} time, labelled with turtles). The ''logical size'' and ''capacity'' of the final array are shown.
RANDOM-ACCESS, VARIABLE-SIZE LIST DATA STRUCTURE THAT ALLOWS ELEMENTS TO BE ADDED OR REMOVED
Growable array; Dynamic table; Array list; ArrayList; Resizable array; Resizeable array; Arraylist; Mutable array
In computer science, a dynamic array, growable array, resizable array, dynamic table, mutable array, or array list is a random access, variable-size list data structure that allows elements to be added or removed. It is supplied with standard libraries in many modern mainstream programming languages.
https://en.wikipedia.org/wiki/Dynamic_array
Array (data structure)         
DATA STRUCTURE
Ragged arrays; Array index; Vector data structure; Array element; Two-dimensional array; One-dimensional array; Vector (Computer Science); Static array; Array data structure; Vector (data structure)
In computer science, an array is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key. An array is stored such that the position of each element can be computed from its index tuple by a mathematical formula.
https://en.wikipedia.org/wiki/Array_(data_structure)
Microelectrode array         
DEVICES THAT CONTAIN MULTIPLE MICROELECTRODES THROUGH WHICH NEURAL SIGNALS ARE OBTAINED OR DELIVERED, ESSENTIALLY SERVING AS NEURAL INTERFACES THAT CONNECT NEURONS TO ELECTRONIC CIRCUITRY
Microelectrode Array; Multi-electrode array; Utah array; Michigan array; Multielectrode array
Microelectrode arrays (MEAs) (also referred to as multielectrode arrays) are devices that contain multiple (tens to thousands) microelectrodes through which neural signals are obtained or delivered, essentially serving as neural interfaces that connect neurons to electronic circuitry. There are two general classes of MEAs: implantable MEAs, used in vivo, and non-implantable MEAs, used in vitro.
https://en.wikipedia.org/wiki/Microelectrode_array
Array Collective         
BELFAST-BASED ARTIST AND ACTIVIST COLLECTIVE WHO WON THE TURNER PRIZE IN 2021
User:Medievalfran/Array Collective
Array Collective is the alias of 11 Belfast-based artists and activists. In 2021 they became the first Northern Irish winners of the Turner Prize.
https://en.wikipedia.org/wiki/Array_Collective
Array data structure         
DATA STRUCTURE
Ragged arrays; Array index; Vector data structure; Array element; Two-dimensional array; One-dimensional array; Vector (Computer Science); Static array; Array data structure; Vector (data structure)
In computer science, an array is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key. An array is stored such that the position of each element can be computed from its index tuple by a mathematical formula.
https://en.wikipedia.org/wiki/Array_(data_structure)

Википедия

Associative array

In computer science, an associative array, map, symbol table, or dictionary is an abstract data type that stores a collection of (key, value) pairs, such that each possible key appears at most once in the collection. In mathematical terms, an associative array is a function with finite domain. It supports 'lookup', 'remove', and 'insert' operations.

The dictionary problem is the classic problem of designing efficient data structures that implement associative arrays. The two major solutions to the dictionary problem are hash tables and search trees. In some cases it is also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized structures.

Many programming languages include associative arrays as primitive data types, and they are available in software libraries for many others. Content-addressable memory is a form of direct hardware-level support for associative arrays.

Associative arrays have many applications including such fundamental programming patterns as memoization and the decorator pattern.

The name does not come from the associative property known in mathematics. Rather, it arises from the fact that values are associated with keys. It is not to be confused with associative processors.

https://en.wikipedia.org/wiki/Associative array
Поиск в словаре
Все словари Английский словарь Англо-арабский словарь Англо-голландский словарь Англо-греческий словарь Англо-испанский словарь Англо-итальянский словарь Англо-немецкий словарь Англо-русский словарь Англо-французский словарь Арабский словарь Голландский словарь Греческий словарь Испанский словарь Итальянский словарь Итальянско-русский словарь Латинско-испанский словарь Латинско-португальский словарь Немецкий словарь Португальский словарь Португальско-русский словарь Русский словарь Французский словарь Французско-русский словарь
Создано ИИ
Английский Русский Испанский Португальский Немецкий Французский Греческий Голландский Итальянский Арабский
Язык интерфейса
Русский English Español Português Deutsch Français Ελληνικά Nederlands Italiano عربي
Контакты
Свяжитесь с нами



Конфиденциальность
Политика конфиденциальности